CS 191 – Fall 2014 Lecture 18 : Fault - tolerance and the threshold theorem

نویسنده

  • Mohan Sarovar
چکیده

Now that we have looked at a few error correction codes and their implementation, we are ready to examine the notion of fault tolerance. The basic idea of fault tolerance is that if we perform error correction “well”, then it is possible to execute an arbitrarily long quantum computation with “reasonable” resources. This may seem intuitive but it is a nontrivial statement because (i) we need to specify how “well” error correction must be performed, and (ii) what we count as “reasonable” resources, and then show that this can still be achieved. This is exactly what the theory of fault tolerance does. The center piece of this theory is the threshold theorem, which we will sketch below. The theorem hinges on three assumptions:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CS 191 , Fall 2014 Lecture 3 : Writing in the Large ( Continued ) September 19 , 2014 Scribe :

In the last lecture, we saw how we should write the title for a paper. We also critiqued some titles of published papers. In this lecture, we will continue the topic of writing in the large. We will discuss writing the date, the abstract, and the introduction. We will also critique an abstract of a paper written by Tom and his former student Geeta. Zobel, in [1], recommends a writer to ask hims...

متن کامل

CS 191 – Fall 2014 Lecture 10 : Generalized measurement , partial trace , and distance in state space

where the Pi are projectors (PiPj = Piδij) and the λi are unique, meaning that the Pi are not necessarily rank 1. If the Pi is not rank 1, then it can be expressed as a sum of rank 1 projectors: i.e., if the rank of Pi is k, Pi = ∣∣φi1〉 〈φi1∣∣+ ∣∣φi2〉 〈φi2∣∣ ...+ ∣∣φik〉 〈φik∣∣. Measuring an observable O on a state |ψ〉 yields a result that we label with the λi, and we think of the measurement as...

متن کامل

Simple proof of fault tolerance in the graph-state model

We consider the problem of fault tolerance in the graph-state model of quantum computation. Using the notion of composable simulations, we provide a simple proof for the existence of an accuracy threshold for graph-state computation by invoking the threshold theorem derived for quantum circuit computation. Lower bounds for the threshold in the graph-state model are then obtained from known boun...

متن کامل

Stability Assessment Metamorphic Approach (SAMA) for Effective Scheduling based on Fault Tolerance in Computational Grid

Grid Computing allows coordinated and controlled resource sharing and problem solving in multi-institutional, dynamic virtual organizations. Moreover, fault tolerance and task scheduling is an important issue for large scale computational grid because of its unreliable nature of grid resources. Commonly exploited techniques to realize fault tolerance is periodic Checkpointing that periodically ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014